Location:
Search - NFA DFA
Search list
Description: NFA DFA相关算法 编译原理的一个实验内容
使用VC++打开-NFA DFA correlation algorithm compiler principles of the use of an experimental content VC Open
Platform: |
Size: 105621 |
Author: chuhaiyun |
Hits:
Description: 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
Platform: |
Size: 10067 |
Author: 成 |
Hits:
Description: 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
Platform: |
Size: 249856 |
Author: 杨震原 |
Hits:
Description: 求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.
Platform: |
Size: 2048 |
Author: 王超 |
Hits:
Description: 自动机DFA在文本检索中的应用 效果很不错 实现了NFA功能-automatic machine DFA in the text retrieval of very good results achieved NFA function
Platform: |
Size: 50176 |
Author: xjt |
Hits:
Description: 有限自动机的确定华，NFA到DFA的转变。-Ascertain of finite auto-machine , from NFA to DFA.
Platform: |
Size: 37888 |
Author: 田永震 |
Hits:
Description: 我的编译原理大作业，自动分析语法，判断语句是否符合规则。DFA即有穷自动机。因为这个工作量比较大，所以恕我不无帐号发放了。-I build large operating principle, automatic syntax analysis, judgment statement with the rules. DFA that the DFA. Because the workload is bigger, it is not without regret that I paid the account.
Platform: |
Size: 197632 |
Author: 高约 |
Hits:
Description: 能够完成正规式到NFA的转换，NFA到DFA的转换（子集法）,DFA的最小化，测试一个生成串是否能为生成的DFA所识别-to complete the formal ceremony to change the NFA, NFA conversion to DFA (subset), the smallest of DFA, testing whether a string of generation to generation by the DFA Recognition
Platform: |
Size: 1010688 |
Author: winpro |
Hits:
Description: 根据输入的正则式产生NFA,然后转化为DFA,并化简-under the importation of which is generated NFA-and then into DFA and Simplification
Platform: |
Size: 6144 |
Author: conan |
Hits:
Description: 有限自动机的确定化及化简
1、更正了 DFA_simplify2 中的错误
2、增加新旧状态对照表 ds_temp
--NFA转DFA
-- 输入字符
-- 要求 id 必须从 1 开始连续递增-Finite Automata and the identification of a simplification, correction of the errors DFA_simplify2 2, increase the old and new state CRT ds_temp-- NFA to DFA-- input characters-- must request id Start an incremental
Platform: |
Size: 3072 |
Author: 黄启龙 |
Hits:
Description: 编译原理课程设计详细文档，包含NFA->DFA,DFA的最小化。-compile detailed design documentation, including NFA-
Platform: |
Size: 98304 |
Author: |
Hits:
Description: NFA转化为DFA的一个程序!希望能有点作用!-NFA into a DFA procedures! Hope to some purpose!
Platform: |
Size: 4096 |
Author: eyeknight |
Hits:
Description: k中心点
编制和调试一个程序，它将用户输入的正规式转换为以状态图和矩阵形式表示的确定有穷自动机。
1．把正规式转换为NFA
2．将NFA确定化为DFA
• ＃作为正规式的终止符
• 考虑复合正规式
• 开始状态号为0
-focal point for the preparation of k and debug a program, it will the user to enter the formal conversion to a state diagram and matrix forms express the determination of DFA. 1. The formal type is converted to NFA2. Will determine the NFA into a DFA
Platform: |
Size: 1024 |
Author: 刘自咏 |
Hits:
Description: 识别正规式，将其转化为nfa,然后转化为dfa-Recognition of formal style, be translated into nfa, and then into a DFA
Platform: |
Size: 1661952 |
Author: 刘自咏 |
Hits:
Description: 输入一个正则表达式（也可以预先将一些测试的正则表达式输入到文件中）
（2）输出相应的NFA图（要求用画图方法完成并要求是逐步逐步进行画，好象书本P47例2.12和2.13一样逐步得到结果）
（3）NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图）
（4）DFA最小化（也要求用画图方法完成）
（5）选做部分：将最小化DFA所对应的识别程序自动产生出来。（将自动产生的识别程序以文件形式保存即可，并可以在系统中查看该文件）
-err
Platform: |
Size: 409600 |
Author: 杨小娜 |
Hits:
Description: 这是一个编译原理中的一个技术，将已有的nfa转换为dfa的程序-This is a Compilation Principle of a technology, the NFA has been converted to DFA procedures
Platform: |
Size: 1024 |
Author: 合合 |
Hits:
Description: 编译课程设计，有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化-Compiler design, finite automata to identify and minimize the completion of the DFA, NFA, RE between the conversion and DFA Minimization
Platform: |
Size: 3577856 |
Author: junjun |
Hits:
Description: 一个大学时候做的编译原理的实验.实验内容是正则表达式到NFA到DFA到最小化DFA最终生成词法分析代码的整个过程的演示.那时由于时间关系,词法分析代码自动生成部分还没完成.-When a university to do the compiling principle experiment. Experiment is a regular expression to NFA to DFA to minimal DFA of the final lexical analysis code to generate the whole process of demonstration. At that time, due to time constraints, lexical analysis part of automatically generated code not yet complete .
Platform: |
Size: 124928 |
Author: THM |
Hits:
Description: 输入一个正则表达式,输出相应的NFA图，NFA转换为DFA，将DFA最小化。-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA, the DFA minimization.
Platform: |
Size: 172032 |
Author: 彪 |
Hits:
«
1
23
4
5
6
7
8
9
10
...
13
»